Systematic generation of ordered sequences using recurrence relations
نویسندگان
چکیده
منابع مشابه
Application of Logic to Combinatorial Sequences and Their Recurrence Relations
2010 Mathematics Subject Classification. 03-02, 03C98, 05-02, 05A15, 11B50 . Partially supported by an ISF grant number 1101/06 and an ERC-2007-StG grant number 202405. Partially supported by the Fein Foundation and the Graduate School of the Technion Israel Institute of Technology. Partially supported by the Israel Science Foundation for the project “Model Theoretic Interpretations of Counting...
متن کاملRecurrence Relations for Polynomial Sequences via Riordan Matrices
We give recurrence relations for any family of generalized Appell polynomials unifying so some known recurrences of many classical sequences of polynomials. Our main tool to get our goal is the Riordan group. We use the product of Riordan matrices to interpret some relationships between different families of polynomials. Moreover using the Hadamard product of series we get a general recurrence ...
متن کاملRecurrence Sequences
Introduction The importance of recurrence sequences hardly needs to be explained. Their study is plainly of intrinsic interest and has been a central part of number theory for many years. Moreover, these sequences appear almost everywhere in mathematics and computer science. For example, the theory of power series representing rational functions [55], pseudo-random number generators ([48], [49]...
متن کاملIntersections of Recurrence Sequences
We derive sharp upper bounds for the size of the intersection of certain linear recurrence sequences. As a consequence of these, we partially resolve a conjecture of Yuan on simultaneous Pellian equations, under the condition that one of the parameters involved is suitably large.
متن کامل( Probabilistic ) Recurrence Relations
The performance attributes of a broad class of randomised algorithms can be described by a recurrence relation of the form T(x) = a(x)+T(H(x)), where a is a function and H(x) is a random variable. For instance, T(x) may describe the running time of such an algorithm on a problem of size x. Then T(x) is a random variable, whose distribution depends on the distribution of H(x). To give high proba...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1971
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/14.2.150